Foreword: Parallelism in Algorithms and Architectures
نویسندگان
چکیده
منابع مشابه
Parallelism and evolutionary algorithms
This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the different families of EAs have naturally converged in the last decade while parallel EAs (PEAs) seem still to lack unified studies, and second, there is a large number of improvements in these algorithms and in their paralleliza...
متن کاملParallelism and Greedy Algorithms
A number of greedy algorithms are examined <and are shown to be probably inherently sequential. Greedy algorithms are presented for finding a maximal path, for finding a . maximal set of disjoint paths in a layered dag, and for finding the largest induced subgraph of a graph that has all vertices of degree at least Ic. It is shown that for all of these algorithms, the problem of determining if ...
متن کاملParallelism in Rendering Algorithms
The need for increased computing power for rendering computer imagery is motivated and the sources from which it might de derived surveyed. Increased power can come from parallelism, as well as faster technology, implying new machine architectures and new algorithms. Surveys sketch early att~mpts at using available parallel architectures and look at the limitations and strengths of some existin...
متن کاملInstruction-level Parallelism in Asynchronous Processor Architectures
The Micronet-based Asynchronous Processor (MAP) is a family of processor architectures based on the micronet model of asynchronous control. Micronets distribute the control amongst the functional units which enables the exploitation of ne-grained concurrency, both between and within program instructions. This paper introduces the mi-cronet model and evaluates the performance of micronet-based d...
متن کاملSequential Algorithms , Deterministic Parallelism , and
We call language L 1 intensionally more expressive than L 2 if there are functions which can be computed faster in L 1 than in L 2. We study the intensional expressive-ness of several languages: the Berry-Curien programming language of sequential algorithms, CDS0, a de-terministic parallel extension to it, named CDSP, and various parallel extensions to the functional programming language PCF. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2014
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-013-9520-x